-
1 Quasi Algorithms
Military: QA -
2 квазиньютоновские алгоритмы
Makarov: quasi-Newton algorithmsУниверсальный русско-английский словарь > квазиньютоновские алгоритмы
См. также в других словарях:
Quasi-threshold graph — In graph theoretic mathematics, a quasi threshold graph is a graph that can be constructed using the following rules: # K 1 is a quasi threshold graph #If G is a quasi threshold graph, then so is the graph obtained by adding a new vertex… … Wikipedia
Quasi-Monte Carlo methods in finance — High dimensional integrals in hundreds or thousands of variables occur commonly in finance. These integrals have to be computed numerically to within a threshold epsilon. If the integral is of dimension d then in the worst case, where one has a… … Wikipedia
Quasi-bipartite graph — In the mathematical field of graph theory, an instance of the Steiner tree problem (consisting of an undirected graph G and a set R of terminal vertices that must be connected to each other) is said to be quasi bipartite if the non terminal… … Wikipedia
Quasi-Newton method — In optimization, quasi Newton methods (also known as variable metric methods) are well known algorithms for finding local maxima and minima of functions. Quasi Newton methods are based on Newton s method to find the stationary point of a function … Wikipedia
Quasi-likelihood — In statistics, quasi likelihood estimation is one way of allowing for overdispersion, that is, greater variability in the data than would be expected from the statistical model used. It is most often used with models for count data or grouped… … Wikipedia
Timeline of algorithms — The following timeline outlines the development of algorithms (mainly mathematical recipes ) since their inception.Before Modern Era* Before Writing about recipes (on cooking, rituals, agriculture and other themes) * c. 1600 BC Babylonians… … Wikipedia
QA — train. abbr. Quasi Algorithms abbr. Quality Assurance abbr. Question & Answers Syn: Q&A abbr. Quick Arbitration (HD) comp. abbr. Quality Assurance … United dictionary of abbreviations and acronyms
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Monte Carlo method — Not to be confused with Monte Carlo algorithm. Computational physics … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia